Racing for Unbalanced Methods Selection
نویسندگان
چکیده
State-of-the-art classification algorithms suffer when the data is skewed towards one class. This led to the development of a number of techniques to cope with unbalanced data. However, as confirmed by our experimental comparison, no technique appears to work consistently better in all conditions. We propose to use a racing method to select adaptively the most appropriate strategy for a given unbalanced task. The results show that racing is able to adapt the choice of the strategy to the specific nature of the unbalanced problem and to select rapidly the most appropriate strategy without compromising the accuracy.
منابع مشابه
Combining Lazy Learning, Racing and Subsampling for Effective Feature Selection
This paper presents a wrapper method for feature selection that combines Lazy Learning, racing and subsampling techniques. Lazy Learning (LL) is a local learning technique that, once a query is received, extracts a prediction by locally interpolating the neighboring examples of the query which are considered relevant according to a distance measure. Local learning techniques are often criticize...
متن کاملAn Empirical Study of Hoeffding Racing for Model Selection in k-Nearest Neighbor Classification
Racing algorithms have recently been proposed as a general-purpose method for performing model selection in machine learning algorithms. In this paper, we present an empirical study of the Hoeffding racing algorithm for selecting the k parameter in a simple k-nearest neighbor classifier. Fifteen widely-used classification datasets from UCI are used and experiments conducted across different con...
متن کاملGenetic analysis of foal and studbook traits in selection for racing performance in trotters
5
متن کاملHorse Racing Prediction Using Artificial Neural Networks
Artificial Neural Networks (ANNs) have been applied to predict many complex problems. In this paper ANNs are applied to horse racing prediction. We employed Back-Propagation, Back-Propagation with Momentum, QuasiNewton, Levenberg-Marquardt and Conjugate Gradient Descent learning algorithms for real horse racing data and the performances of five supervised NN algorithms were analyzed. Data colle...
متن کاملProspection of genomic regions divergently selected in racing line of Quarter Horses in relation to cutting line.
Selection of Quarter Horses for different purposes has led to the formation of lines, including racing and cutting horses. The objective of this study was to identify genomic regions divergently selected in racing line of Quarter Horses in relation to cutting line applying relative extended haplotype homozygosity (REHH) analysis, an extension of extended haplotype homozygosity (EHH) analysis, a...
متن کامل